Cycle structure of random parking functions
نویسندگان
چکیده
We initiate the study of cycle structure uniformly random parking functions. Using combinatorics completions, we compute asymptotic expected value number cycles any fixed length. obtain an upper bound on total variation distance between joint distribution counts and independent Poisson variables using a multivariate version Stein's method via exchangeable pairs. Under mild condition, process converges in to variables.
منابع مشابه
Transitive cycle factorizations and prime parking functions
Minimal transitive cycle factorizations and parking functions are related very closely. Using the correspondence between them, we find a bijection between minimal transitive factorizations of permutations of type (1, n − 1) and prime parking functions of length n.
متن کاملCounting Defective Parking Functions
Suppose that m drivers each choose a preferred parking space in a linear car park with n spaces. Each driver goes to the chosen space and parks there if it is free, and otherwise takes the first available space with a larger number (if any). If all drivers park successfully, the sequence of choices is called a parking function. In general, if k drivers fail to park, we have a defective parking ...
متن کاملGenomes and Parking Functions
This paper will focus on rearrangements of genomes containing linear chromosomes. The goal is to be able to be able to enumerate thee rearrangements. This will be done first by determining the number of operations required to rearrange one genome into another. Then if the order in which these operations occur can be altered, the resulting effects on the enumeration will be determined. We will b...
متن کاملParking on a Random Tree
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Rényi’s parking problem, alternatively called blocking RSA (random sequential adsorption): at every vertex of the tree a particle (or “car”) arrives with rate one. The particle sticks to the vertex whenever the ver...
متن کاملCycle structure of random permutations with cycle weights
We investigate the typical cycle lengths, the total number of cycles, and the number of finite cycles in random permutations whose probability involves cycle weights. Typical cycle lengths and total number of cycles depend strongly on the parameters, while the distributions of finite cycles are usually independent Poisson random variables. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 44,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2023
ISSN: ['1090-2074', '0196-8858']
DOI: https://doi.org/10.1016/j.aam.2022.102458